Towards quantum template matching

نویسندگان

  • Daniel Curtis
  • David A. Meyer
چکیده

We consider the problem of locating a template as a subimage of a larger image. Computing the maxima of the correlation function solves this problem classically. Since the correlation can be calculated with the Fourier transform this problem is a good candidate for a superior quantum algorithmic solution. We outline how such an algorithm would work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Similarity Measures for Template Matching

Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...

متن کامل

A New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA

Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...

متن کامل

Template Matching with Ranking for Toffoli Circuits

Circuit realizations generated by reversible logic synthesis approaches may not be optimal, thus it is common to apply post-synthesis optimization techniques. This paper proposes an algorithm that uses a ranking system for identifying the best match with circuitreduction templates. These templates incorporate both positive and negative control Toffoli gates. A reduction in quantum cost was achi...

متن کامل

Unstructured Fingerprint Database Matching Method Based on Grover's Quantum Algorithm

Traditional fingerprint matching has slow speed and low probability in search rate under large-scale and unstructured database background. In order to solve this problem, an advanced searching method based on Grover’s search algorithm is proposed. It improves the Oracle operator in Grover’s algorithm and transforms the database one into four registers: index register, quantum bit register which...

متن کامل

A Wavelet-Based Approach to Template Matching Under Scaling and Translation

In this paper we study the problem of template matching in signals, specifically focusing on images. First we present the solution to the case where the template is translated in the image, then discuss how to locate a template if it appears scaled in the image. The tools used for this scaling algorithm are wavelets, specifically the Haar wavelet. Wavelets naturally encode scaling information, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003